Coronary Vein Extraction in MSCT Volumes Using Minimum Cost Path and Geometrical Moments

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Two Point Minimum Cost Path Approach for CTA Coronary Centerline Extraction

In this work a minimum cost path approach is adopted to extract coronary artery centerlines from CTA data. The algorithm depends on the manual definition of the start and end point of the vessel. The cost image used in the minimal cost path approach is based on a vesselness measure and a smooth window function on intensity. In the majority of the cases the method was able to extract the centerl...

متن کامل

Cardiac motion-corrected iterative cone-beam CT reconstruction using a semi-automatic minimum cost path-based coronary centerline extraction

In this paper a method which combines iterative computed tomography reconstruction and coronary centerline extraction technique to obtain motion artifact-free reconstructed images of the coronary arteries are proposed and evaluated. The method relies on motion-vector fields derived from a set of coronary centerlines extracted at multiple cardiac phases within the R-R interval. Hereto, start and...

متن کامل

3D MRA coronary axis determination using a minimum cost path approach.

A method is introduced to automatically find the coronary axis based on two or more user-defined points, even in the presence of a severe stenosis. The coronary axis is determined by finding a minimum cost path (MCP) in a feature image in which the tubular-like structures are enhanced. The results of the proposed method were compared with manually drawn central axes to estimate the accuracy. In...

متن کامل

Minimum cost-reliability ratio path problem

The problem of finding a minimal cost-reliability ratio path is considered. The optimal solution to this problem is shown to map into an extreme supported non-dominated objective point in the objective space of the biobjective shortest path problem. Different forms of reliability are presented. We assume that this reliability does not change over time. We employ a parametric network simplex alg...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Journal of Biomedical and Health Informatics

سال: 2013

ISSN: 2168-2194,2168-2208

DOI: 10.1109/jbhi.2013.2245420